Properties of two-dimensional sets with small sumset
نویسندگان
چکیده
Let A, B ⊆ R be finite, nonempty subsets, let s ≥ 2 be an integer, and let h1(A,B) denote the minimal number t such that there exist 2t (not necessarily distinct) parallel lines, l1, . . . , lt, l ′ 1, . . . , l ′ t , with A ⊆ ⋃t i=1 li and B ⊆ ⋃t i=1 l ′ i . Suppose h1(A,B) ≥ s. Then we show that: (a) if ||A| − |B|| ≤ s and |A|+ |B| ≥ 4s − 6s+ 3, then |A+B| ≥ (2− 1 s )(|A| + |B|)− 2s+ 1; (b) if |A| ≥ |B|+ s and |B| ≥ 2s − 72s+ 3 2 , then |A+B| ≥ |A|+ (3− 2 s )|B| − s; (c) if |A| ≥ 1 2s(s−1)|B|+s and either |A| > 18 (2s−1)2|B|− 1 4 (2s−1)+ (s−1) 2(|B|−2) or |B| ≥ 2s+4 3 , then |A+B| ≥ |A|+ s(|B| − 1). This extends the 2-dimensional case of the Freiman 2–Theorem to distinct sets A and B, and, in the symmetric case A = B, improves the best prior known bound for |A| + |B| (due to Stanchescu, and which was cubic in s) to an exact value. As part of the proof, we give general lower bounds for two dimensional subsets that improve the 2-dimensional case of estimates of Green and Tao and of Gardner and Gronchi, and that generalize the 2-dimensional case of the Brunn-Minkowski Theorem.
منابع مشابه
Feature Selection for Small Sample Sets with High Dimensional Data Using Heuristic Hybrid Approach
Feature selection can significantly be decisive when analyzing high dimensional data, especially with a small number of samples. Feature extraction methods do not have decent performance in these conditions. With small sample sets and high dimensional data, exploring a large search space and learning from insufficient samples becomes extremely hard. As a result, neural networks and clustering a...
متن کاملOn Lower Order Extremal Integral Sets Avoiding Prime Pairwise Sums
Let A be a subset of {1, 2, . . . , n} such that the sum of no two distinct elements of A is a prime number. Such a subset is called a prime-sumset-free subset of {1, 2, . . . , n}. A prime-sumset-free subset is called an extremal prime-sumset-free subset of {1, 2, . . . , n} if A ∪ {a} is not a prime-sumset-free subset for any a ∈ {1, 2, . . . , n} \ A. We prove that if n ≥ 10 then there is no...
متن کاملStructure Theory of Set Addition
Freiman’s theorem concerns the structure of sets with small sumset. Let A be a subset of an abelian group G, and define the sumset A + A to be the set of all pairwise sums a + a′, where a, a′ are (not necessarily distinct) elements of A. If |A| = n then |A + A| ≥ n, and equality can occur (for example if A is a subgroup of G). In the other direction we have |A + A| ≤ n(n + 1)/2, and equality ca...
متن کاملSets with Small Sumset and Rectification
We study the extent to which sets A ⊆ Z/NZ, N prime, resemble sets of integers from the additive point of view (“up to Freiman isomorphism”). We give a direct proof of a result of Freiman, namely that if |A+A| 6 K|A| and |A| < c(K)N then A is Freiman isomorphic to a set of integers. Because we avoid appealing to Freiman’s structure theorem, we get a reasonable bound: we can take c(K) > (32K) 2 ...
متن کاملSumset and Inverse Sumset Theory for Shannon Entropy
Let G = (G,+) be an additive group. The sumset theory of Plünnecke and Ruzsa gives several relations between the size of sumsets A + B of finite sets A, B, and related objects such as iterated sumsets kA and difference sets A−B, while the inverse sumset theory of Freiman, Ruzsa, and others characterises those finite sets A for which A+A is small. In this paper we establish analogous results in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 117 شماره
صفحات -
تاریخ انتشار 2010